Playing Games with Approximation Algorithms

Playing Games with Genetic Algorithms

In 1987 the first published research appeared which used the Genetic Algorithm as a means of seeking better strategies in playing the repeated Prisoner’s Dilemma. Since then the application of Genetic Algorithms to game-theoretical models has been used in many ways. To seek better strategies in historical oligopolistic interactions, to model economic learning, and to explore the support of coop...

Algorithms for Playing Games with Limited Randomness

We study multiplayer games in which the participants have access to only limited randomness. This constrains both the algorithms used to compute equilibria (they should use little or no randomness) as well as the mixed strategies that the participants are capable of playing (these should be sparse). We frame algorithmic questions that naturally arise in this setting, and resolve several of them...

Playing Games with Timed Games

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. Following the example of timed simulation between timed automata, we define timed alternating simulation as a preorder between timed game automata, which preserves controllability. We define a method to reduce the timed alternating simulation prob...

Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and Constraint Logic, which provides a f...

Playing Games with Algorithms: Algorithmi Combinatorial Game Theory